Heuristics for Quantum Computing Dealing with 3-SAT
نویسندگان
چکیده
The SAT problem is maybe one of the most famous NP-complete problems. This paper deals with 3-SAT problem. We follow a sort incremental strategy to save computational costs respect classical quantum computing approach. present an heuristics that leads this strategy, improving performance purely random scheme. finally validate our approach by means thorough empirical study.
منابع مشابه
Heuristics for Planning with SAT
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performance by making the SAT solving process more application-specific. In this paper we propose a variable selection strategy for AI planning. The strategy is based on generic principles about properties of plans, and its per...
متن کاملSymbiosis of Search and Heuristics for Random 3-SAT
When combined properly, search techniques can reveal the full potential of sophisticated branching heuristics. We demonstrate this observation on the well-known class of random 3-SAT formulae. First, a new branching heuristic is presented, which generalizes existing work on this class. Much smaller search trees can be constructed by using this heuristic. Second, we introduce a variant of discre...
متن کاملPlanning with SAT, Admissible Heuristics and A*
We study the relationship between optimal planning algorithms, in the form of (iterative deepening) A∗ with (forward) state-space search, and the reduction of the problem to SAT. Our results establish a strict dominance relation between the two approaches: any iterative deepening A∗ search can be efficiently simulated in the SAT framework, assuming that the heuristic has been encoded in the SAT...
متن کاملEvolved Preambles for MAX-SAT Heuristics
MAX-SAT heuristics normally operate from random initial truth assignments to the variables. We consider the use of what we call preambles, which are sequences of variables with corresponding single-variable assignment actions intended to be used to determine a more suitable initial truth assignment for a given problem instance and a given heuristic. For a number of well established MAX-SAT heur...
متن کاملStrong Refutation Heuristics for Random k-SAT
A simple first moment argument shows that in a randomly chosen k-SAT formula with m clauses over n boolean variables, the fraction of satisfiable clauses is at most 1−2−k+o(1) as m/n →∞ almost surely. In this paper, we deal with the corresponding algorithmic strong refutation problem: given a random k-SAT formula, can we find a certificate that the fraction of satisfiable clauses is at most 1 −...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11081888